Application of linear logic to Backward Reachability Analysis of Colored Petri Nets
نویسندگان
چکیده
This paper deals with a formal method for the study of the backward reachability analysis applied on Colored Petri Nets (CPN). The proposed method proceeds in two steps : 1) it translates CPN to terms of the Multiplicative Intuitionistic Linear Logic (MILL); 2) it proves sequents by constructing proof trees. The translation from CPN to MILL must respect some properties such as the semantic associated to tokens. That is why, the First-Order MILL (MILL1) is used for translation. The reachability between two markings, the initial marking and the final marking, is expressed by a sequent which can be proven (if the initial marking is backward-reachable from the final one) using first-order terms unification and/or marking enhancement.
منابع مشابه
Backward Reachability Analysis of Colored Petri Nets
This paper deals with a formal method for the study of the backward reachability analysis applied on Colored Petri Nets (CPN). The proposed method proceeds in two steps : 1) it translates CPN to terms of the Multiplicative Intuitionistic Linear Logic (MILL); 2) it proves sequents by constructing proof trees. The translation from CPN to MILL must respect some properties such as the semantic asso...
متن کاملModel Checking Based on Kronecker Algebra
Reachability analysis is a general approach to analyze Petri nets, but the state space explosion often permits its application. In the eld of performance analysis of stochastic Petri nets, modular representations of reachability graphs using Kronecker algebra have been successfully applied. This paper describes how a Kronecker representation of the reachability graph is employed for exploration...
متن کاملBackward reachability of Colored Petri Nets for systems diagnosis
Embedded systems development creates a need of new design, verification and validation technics. Formal methods appear as a very interesting approach for embedded systems analysis, especially for dependability studies. The chosen formalism for this work is based on Colored Petri Net (CPN)for two main reasons : the expressivity and the formal nature. Also, they model easily the static and the dy...
متن کاملAn Application of a Temporal Linear Logic to Timed Petri Nets
It is well known that the Petri net reachability is equivalent to the provability for the corresponding sequent of linear logic. It is a system which has expressive powers of resources, but does not provide a concept of time to encode timed Petri nets naturally. So we introduce a resource-conscious and time-dependent system, that is, temporal linear logic. The aim of the paper is to show the (d...
متن کاملPropositional Temporal Linear Logic and its Application to Concurrent Systems
In computer science, concepts of resource such as data consumption and of time such as execution time are very important. Logical systems which can treat them have been applied in that field. Linear logic has been called a resource conscious logic. The expressive power is enough to describe a dynamic change in process environments. However, linear logic is not enough to treat a dynamic change i...
متن کامل